Efficient searching using partial ordering
نویسندگان
چکیده
منابع مشابه
Searching Using Partial Ordering
Given a set U of n distinct numbers, we are interested in preprocessing them, so that subsequent rrembership queries of the form ‘Is y E U?’ can be answered quickly. For example, if one sorts the elements of U, then each query can be answerred in pg(n + I)1 comparisons by a binary search. This may be contrasted with the situation where no preprocessing is done, when n comparisons are needed to ...
متن کاملEfficient Data Storage and Searching for Location Based Services using Quadtrees and H-ordering
Data is always stored in secondary storage Devices due to its volume. When it is stored in secondary storage devices, it is required that the access time is as minimal as possible. Most of the queries issued for providing location based services, result in accessing nearest point. This paper provides an algorithm to store the data efficiently so that accessing time is reduced for answering such...
متن کاملEfficient Dynamic Range Searching Using Data Replication
Given the lower bound of (n(d 1)=d) for range query time complexity on n d-dimensional point data, we investigate whether little replication can improve the query and update times significantly. We propose linear-space index structures that minimize the query and update times; the query time we achieve is O(n ) for any > 0, and, the update time is O(logn).
متن کاملEfficient Web Searching Using Temporal Factors
We study the issues involved in the design of algorithms for performing information gathering more e!ciently, by taking advantage of anticipated variations in access times in di:erent regions at di:erent times of the day or week. We look at the problem theoretically, as a generalisation of single processor sequencing with release times and deadlines, in which performance times (lengths) of the ...
متن کاملEfficient Communication Using Partial Information
We show how to efficiently simulate the sending of a message M to a receiver who has partial information about the message, so that the expected number of bits communicated in the simulation is close to the amount of additional information that the message reveals to the receiver. We use our simulation method to obtain several results in communication complexity. • We prove a new direct sum the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 1981
ISSN: 0020-0190
DOI: 10.1016/0020-0190(81)90005-3